Selection of Initial Centroids for k-Means Algorithm
نویسندگان
چکیده
Clustering is one of the important data mining techniques. k-Means [1] is one of the most important algorithm for Clustering. Traditional k-Means algorithm selects initial centroids randomly and in k-Means algorithm result of clustering highly depends on selection of initial centroids. k-Means algorithm is sensitive to initial centroids so proper selection of initial centroids is necessary. This paper introduces an efficient method to start the k-Means with good initial centroids. Good initial centroids are useful for better clustering. Key Terms: Data mining; clustering; k-Means
منابع مشابه
An Efficient Approach towards K-Means Clustering Algorithm
K-Means clustering algorithms are used in various practical applications countless times. Original K-Means algorithm select initial centroids randomly it generates unstable cluster as the value of object in cluster depend on the selection of initial cluster means which is done by random selection of objects. The number of times different selection of initial centroids will give number of differ...
متن کاملEfficient and Fast Initialization Algorithm for K- means Clustering
The famous K-means clustering algorithm is sensitive to the selection of the initial centroids and may converge to a local minimum of the criterion function value. A new algorithm for initialization of the K-means clustering algorithm is presented. The proposed initial starting centroids procedure allows the K-means algorithm to converge to a “better” local minimum. Our algorithm shows that ref...
متن کاملAn Effective and Efficient Algorithm for Document Clustering
This paper proposes an effective and efficient algorithm for clustering text documents. This algorithm is formulated by using the concept of well known k-means algorithm. The standard k-means algorithm suffers from the problem of random initialization of initial cluster centers. The proposed algorithm eliminates this problem by introducing a new approach for selection of initial cluster centroi...
متن کاملOptimization of Initial Centroids for K-Means Algorithm Based on Small World Network
K-means algorithm is a relatively simple and fast gather clustering algorithm. However, the initial clustering center of the traditional k-means algorithm was generated randomly from the dataset, and the clustering result was unstable. In this paper, we propose a novel method to optimize the selection of initial centroids for k-means algorithm based on the small world network. This paper firstl...
متن کاملGraph based Text Document Clustering by Detecting Initial Centroids for k-Means
Document clustering is used in information retrieval to organize a large collection of text documents into some meaningful clusters. k-means clustering algorithm of pratitional category, performs well on document clustering. k-means organizes a large collection of items into k clusters so that a criterion function is optimized. As it is sensitive to the initial values of cluster centroids, this...
متن کامل